On Poisoned Wardrop Equilibrium in Congestion Games

Wardrop Equilibrium and Potential Games in Wireless

We investigate the relevance of application of game theory to the field of wireless ad-hoc networks. We give distributed algorithms for routing and multihoming in wireless ad-hoc networks. We propose a distributed routing scheme for a broad class of wireless ad-hoc networks which converges (in the Cesaro sense) to the set of Cesaro-Wardrop equilibria. Convergence is established by formulating a...

Strong Equilibrium in Congestion Games

Robust Wardrop Equilibrium

Network games can be used to model competitive situations in which players select routes to maximize their utility. Common applications include traffic, telecommunication and distribution networks. Although traditional network models have assumed that utilities only depend on congestion, in most applications they also have an uncertain component. In this work, we extend Wardrop’s network game (...

Greediness and Equilibrium in Congestion Games

Rosenthal (1973) introduced the class of congestion games and proved that they always possess a Nash equilibrium in pure strategies. Fotakis et al. (2005) introduce the notion of a greedy strategy tuple, where players sequentially and irrevocably choose a strategy that is a best response to the choice of strategies by former players. Whereas the former solution concept is driven by strong assum...

Equilibrium and Potential in Coalitional Congestion Games

The model of congestion games is widely used to analyze games related to traffic and communication. A central property of these games is that they are potential games and hence posses a pure Nash equilibrium. In reality it is often the case that some players cooperatively decide on their joint action in order to maximize the coalition’s total utility. This is by modeled by Coalitional Congestio...